An Upper Bound for the Maximum Cut Mean Value
نویسندگان
چکیده
Let MaxCut(G) be the value of the maximum cut of a graph G. Let f(x, n) be the expectation of MaxCut(G)/xn for random graphs with n vertices and xn edges and let r(x, n) be the expectation of MaxCut(G)/xn for random 2x-regular graphs with n vertices. We prove, for sufficiently large x: 1. limn→∞ f(x, n) ≤ 12 + √ ln 2 2x , 2. limn→∞ r(x, n) ≤ 12 + 1 √ x + 1 2 ln x x .
منابع مشابه
Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملSolving the Paradox of Multiple IRR\'s in Engineering Economic Problems by Choosing an Optimal -cut
Until now single values of IRR are traditionally used to estimate the time value of cash flows. Since uncertainty exists in estimating cost data, the resulting decision may not be reliable. The most commonly cited drawbacks to using the internal rate of return in evaluatton of deterministic cash flow streams is the possibility of multiple conflicting internal rates of return. In this paper we p...
متن کاملUpper bound and numerical analysis of cyclic expansion extrusion (CEE) process
Deformation of the material during cyclic expansion extrusion (CEE) is investigated using upper-bound theorem. The analytical approximation of forming loads agrees very well with the FEM results for different amounts of chamber diameter, friction factor and also for lower die angles. However, the difference between analytical and numerical solution increases at higher die angles which are expla...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کامل3 Problem Definition
Given an undirected edge-weighted graph, G = (V,E), the maximum cut problem (Max-Cut) is to find a bipartition of the vertices that maximizes the weight of the edges crossing the partition. If the edge weights are non-negative, then this problem is equivalent to finding a maximum weight subset of the edges that forms a bipartite subgraph, i.e. the maximum bipartite subgraph problem. All results...
متن کامل